Modular arithmetic

ثبت نشده
چکیده

Since congruence modulo m is an equivalence relation, it partitions the universe of integers into equivalence classes, which we’ll call congruence classes modulo m. Within any one of these classes, all of the members are congruent to all of the other members; but congruence modulo m never holds between members of different equivalence classes. For instance, there are two congruence classes modulo 2, one of which has all the even numbers as members, while the other has all the odd numbers. In general, there are m congruence classes modulo m.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Satisfiability of Modular Arithmetic Formulae

Modular arithmetic is the underlying integral computation model in conventional programming languages. In this paper, we discuss the satisfiability problem of propositional formulae in modular arithmetic over the finite ring Z2ω . Although an upper bound of 2 2 O(n4) can be obtained by solving alternation-free Presburger arithmetic, it is easy to see that the problem is in fact NP-complete. Fur...

متن کامل

The Arithmetic Subgroups and Their Modular Forms

Arithmetic subgroups are finite index subgroups of the modular group. Classically, congruence arithmetic subgroups, which can be described by congruence relations, are playing important roles in group theory and modular forms. In reality, the majority of arithmetic subgroups are noncongruence. These groups as well as their modular forms are central players of this survey article. Differences be...

متن کامل

On the Satisfiability of Modular Arithmetic Formula

Modular arithmetic is the underlying integer computation model in conventional programming languages. In this paper, we discuss the satisfiability problem of modular arithmetic formulae over the finite ring Z2ω . Although an upper bound of 2 2 4) can be obtained by solving alternation-free Presburger arithmetic, it is easy to see that the problem is in fact NP-complete. Further, we give an effi...

متن کامل

Borcherds products and arithmetic intersection theory on Hilbert modular surfaces

We prove an arithmetic version of a theorem of Hirzebruch and Zagier saying that Hirzebruch-Zagier divisors on a Hilbert modular surface are the coefficients of an elliptic modular form of weight two. Moreover, we determine the arithmetic selfintersection number of the line bundle of modular forms equipped with its Petersson metric on a regular model of a Hilbert modular surface, and study Falt...

متن کامل

Arithmetic Intersection on a Hilbert Modular Surface and the Faltings Height

In this paper, we prove an explicit arithmetic intersection formula between arithmetic Hirzebruch-Zagier divisors and arithmetic CM cycles in a Hilbert modular surface over Z. As applications, we obtain the first ‘non-abelian’ Chowla-Selberg formula, which is a special case of Colmez’s conjecture; an explicit arithmetic intersection formula between arithmetic Humbert surfaces and CM cycles in t...

متن کامل

An Enhanced Residue Modular Multiplier for Cryptography

This paper presents an implementation of VLSI architecture for Dual Field Residue Arithmetic modular multiplier with less delay based on finite field arithmetic to support all public key cryptographic applications. A new method for incorporating Residue Number System (RNS) and Polynomial Residue Number system (PRNS) in modular multiplication is derived and then implemented VLSI Architecture for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016